On Permutation Masks in Hamming Negative Selection
نویسندگان
چکیده
Abstract. Permutation masks were proposed for reducing the number of holes in Hamming negative selection when applying the r-contiguous or r-chunk matching rule. Here, we show that (randomly determined) permutation masks re-arrange the semantic representation of the underlying data and therefore shatter self-regions. As a consequence, detectors do not cover areas around self regions, instead they cover randomly distributed elements across the space. In addition, we observe that the resulting holes occur in regions where actually no self regions should occur.
منابع مشابه
Application of the feature-detection rule to the Negative Selection Algorithm
The Negative Selection Algorithm developed by Forrest et al. was inspired by the way in which T-cell lymphocytes mature within the thymus before being released into the blood system. The mature T-cell lymphocytes exhibit an interesting characteristic, in that they are only activated by non-self cells that invade the human body. The Negative Selection Algorithm utilises an affinity matching func...
متن کاملOn permutation automorphism groups of q-ary Hamming codes
It is established that for any q > 2 the permutation automorphism group of a q-ary Hamming code of length n = (q − 1)/(q− 1) is isomorphic to the unitriangular group UTm(q).
متن کاملGeneralization Regions in Hamming Negative Selection
Negative selection is an immune-inspired algorithm which is typically applied to anomaly detection problems. We present an empirical investigation of the generalization capability of the Hamming negative selection, when combined with the r-chunk affinity metric. Our investigations reveal that when using the rchunk metric, the length r is a crucial parameter and is inextricably linked to the inp...
متن کاملPermutation codes invariant under isometries
The symmetric group Sn on n letters is a metric space with respect to the Hamming distance. The corresponding isometry group is well known to be isomorphic to the wreath product Sn oS2. A subset of Sn is called a permutation code or a permutation array, and the largest possible size of a permutation code with minimum Hamming distance d is denoted by M(n, d). Using exhaustive search by computer ...
متن کاملNew bounds of permutation codes under Hamming metric and Kendall's τ -metric
Permutation codes are widely studied objects due to their numerous applications in various areas, such as power line communications, block ciphers, and the rank modulation scheme for flash memories. Several kinds of metrics are considered for permutation codes according to their specific applications. This paper concerns some improvements on the bounds of permutation codes under Hamming metric ...
متن کامل